A new proof of 3-colorability of Eulerian triangulations
نویسندگان
چکیده
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short constructive proof of the theorem of Heawood that Eulerian triangulations are 3-colorable.
منابع مشابه
3-Colorability of Pseudo-Triangulations
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain classes of plane graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-triangulations (a generalization of triangulations) and prove NP-completeness for this class. The complexity status does not change if the maximum face-degree is bounded to fo...
متن کاملColoring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given.
متن کاملColoring Eulerian Triangulations of the Klein Bottle
We show that an Eulerian triangulation of the Klein bottle has chromatic number equal to six if and only if it contains a complete graph of order six, and it is 5-colorable, otherwise. As a consequence of our proof, we derive that every Eulerian triangulation of the Klein bottle with facewidth at least four is 5-colorable.
متن کاملInternational Journal of Computational Geometry & Applications
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. 31 However, for certain families of graphs, like triangulations, polynomial time algorithms 32 exist. We consider the family of pseudo-triangulations, which are a generalization of 33 triangulations, and prove NP-completeness for this class. This result also holds if we 34 bound their face degree to four, or...
متن کاملHamiltonian Cycles on Random Eulerian Triangulations
A random Eulerian triangulation is a random triangulation where an even number of triangles meet at any given vertex. We argue that the central charge increases by one if the fully packed O(n) model is defined on a random Eulerian triangulation instead of an ordinary random triangulation. Considering the case n → 0, this implies that the system of random Eulerian triangulations equipped with Ha...
متن کامل